Extremal k-forcing sets in oriented graphs
نویسندگان
چکیده
منابع مشابه
Score Sets in Oriented k - partite Graphs
Let D(U1, U2, ..., Uk) be an oriented k -partite graph with |Ui| = ni, 1 ≤ i ≤ k. Then, the score of a vertex ui in Ui is defined by aui (or simply ai ) = ∑k t=1, t 6=i nt+d + ui −d − ui , where d+ui and d − ui are respectively the outdegree and indegree of ui. The set A of distinct scores of the vertices of D(U1, U2, ..., Uk) is called its score set. In this paper, we prove that if a1 is a non...
متن کاملRadius-forcing sets in graphs
Let G be a connected graph of order p and let 0 ::f. s ~ V ( G). Then S is a rad(G)-forcing set (or a radius-forcing set of G) if, for each v E V(G), there exists v' E S with dc(v, v') ?: rad(G). The cardinality of a smallest radius-forcing set of G is called the radius-forcing number of G and is denoted by rf(G). A graph G is called a randomly k-forcing graph for a positive integer k if every ...
متن کاملGraphs with Extremal Connected Forcing Numbers
Zero forcing is an iterative graph coloring process where at each discrete time step, a colored vertex with a single uncolored neighbor forces that neighbor to become colored. The zero forcing number of a graph is the cardinality of the smallest set of initially colored vertices which forces the entire graph to eventually become colored. Connected forcing is a variant of zero forcing in which t...
متن کاملOn extremal k-supereulerian graphs
A graph G is called k-supereulerian if it has a spanning even subgraph with at most k components. In this paper, we prove that any 2-edge-connected loopless graph of order n is ⌈(n − 2)/3⌉-supereulerian, with only one exception. This result solves a conjecture in [Z. Niu, L. Xiong, Even factor of a graphwith a bounded number of components, Australas. J. Combin. 48 (2010) 269–279]. As applicatio...
متن کاملOn extremal k-outconnected graphs
Let G be a minimally k-connected graph with n nodes and m edges. Mader proved that if n ≥ 3k− 2 then m ≤ k(n− k), and for n ≥ 3k− 1 an equality is possible if, and only if, G is the complete bipartite graph Kk,n−k. Cai proved that if n ≤ 3k − 2 then m ≤ b(n + k)2/8c, and listed the cases when this bound is tight. In this paper we prove a more general theorem, which implies similar results for m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2019
ISSN: 0166-218X
DOI: 10.1016/j.dam.2019.02.004